Confronting Two-Pair Primer Design using Memetic Algorithm
نویسندگان
چکیده
Polymerase chain reaction with confronting two-pair primers (PCR-CTPP) is a simple, timeand cost-effective SNP genotyping method. In this study, we propose a MA (memetic algorithm)-based method to design a feasible CTPP primer set. Overall, 288 SNPs in the SLC6A4 gene were tested in silico by the proposed method. The results indicate that the proposed method provides feasible CTPP primers that conform to the commonly used constraints. This method could assist biologists and other researchers in obtaining a feasible CTTP primer
منابع مشابه
Natural SNP-RFLP Primer Design using Memetic Algorithm
Single nucleotide polymorphisms (SNPs) can be genotyped by polymerase chain reaction-restriction fragment length polymorphism (PCR-RFLP). Before performing PCR-RFLP for SNP genotyping, a feasible primer pair observes numerous constraints and an available restriction enzyme discriminate the target SNP, are required, here we called it natural SNP-RFLP primer design. Design the natural SNP-RFLP pr...
متن کاملSpecific PCR product primer design using memetic algorithm.
To provide feasible primer sets for performing a polymerase chain reaction (PCR) experiment, many primer design methods have been proposed. However, the majority of these methods require a relatively long time to obtain an optimal solution since large quantities of template DNA need to be analyzed. Furthermore, the designed primer sets usually do not provide a specific PCR product size. In rece...
متن کاملPrimer Design with Specific PCR Product using Particle Swarm Optimization
Before performing polymerase chain reactions (PCR), a feasible primer set is required. Many primer design methods have been proposed for design a feasible primer set. However, the majority of these methods require a relatively long time to obtain an optimal solution since large quantities of template DNA need to be analyzed. Furthermore, the designed primer sets usually do not provide a specifi...
متن کاملSOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM
In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...
متن کاملA Flexible Integrated Forward/ Reverse Logistics Model with Random Path-based Memetic Algorithm
Due to business and environmental issues, the efficient design of an integrated forward/reverse logistics network has recently attracted more attention from researchers. The significance of transportation cost and customer satisfaction spurs an interest in developing a flexible network design model with different delivery paths. This paper proposes a flexible mixed-integer programming model to ...
متن کامل